Global minimization of constrained problems with discontinuous penalty functions
نویسندگان
چکیده
منابع مشابه
Hessian Matrices of Penalty Functions for Solving Constrained-optimization Problems
This paper deals with the Hessian matrices of penalty functions, evaluated at their minimizing point. It is concerned with the condition number of these matrices for small values of a controlling parameter. At the end of the paper a comparison is made between different types of penalty functions on the grounds of the results obtained. 1. Classification of penalty-function techniques Throughout ...
متن کاملAn Algorithm for Global Minimization of Linearly Constrained Quadratic Functions
A branch and bound algorithm is proposed for finding an approximate global optimum of quadratic functions over a bounded polyhedral set. The algorithm uses Lagrangian duality to obtain lower bounds. Preliminary computational results are reported.
متن کاملInterior Penalty Discontinuous Approximations of Elliptic Problems
This paper studies an interior penalty discontinuous approximation of elliptic problems on non–matching grids. Error analysis, interface domain decomposition type preconditioners, as well as numerical results illustrating both, discretization errors and condition number estimates of the problem and reduced forms of it, are presented.
متن کاملPart I. Improved Energy Estimates for Interior Penalty, Constrained and Discontinuous Galerkin Methods for Elliptic Problems
Three Galerkin methods using discontinuous approximation spaces are introduced to solve elliptic problems. The underlying bilinear form for all three methods is the same and is nonsymmetric. In one case, a penalty is added to the form and in another, a constraint on jumps on each face of the triangulation. All three methods are locally conservative and the third one is not restricted. Optimal a...
متن کاملOn the Use of Non-Stationary Penalty Functions to Solve Nonlinear Constrained Optimization Problems with GA's
In this paper we discuss the use of non-stationary penalty functions to solve general nonlinear programming problems (NP) using real-valued GAS. The non-stationary penalty is a function of the generation number; as the number of generations increases so does the penalty. Therefore, as the penalty increases it puts more and more selective pressure on the GA to find a feasible solution. The ideas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1999
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(99)00058-9